On Merging Taxonomies under RCC-5 Algebraic Articulations

نویسندگان

  • David Thau
  • Shawn Bowers
  • Bertram Ludäscher
چکیده

Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain. Given a set of correspondences between two taxonomies, it is often necessary to “merge” the taxonomies, thereby creating a unified taxonomy (e.g., that can then be used by data integration and discovery applications). We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints. Two taxa N and M can be related using (disjunctions of) the five base relations in RCC-5: N ≡ M; N ( M; N ); N ⊕ M (partial overlap of N and M); and N ! M (disjointness: N ∩ M = ∅). RCC-5 is increasingly being adopted by scientists to specify mappings between large biological taxonomies. We discuss the properties of the proposed merge algorithm and evaluate our approach using realworld taxonomies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CleanTax: A Framework for Reasoning about Taxonomies

The CleanTax framework relates (aligns) taxonomies (inclusion hierarchies) to one another using relations drawn from the RCC-5 algebra. The taxonomies, represented as partial orders with additional constraints, can frequently (but not always) be represented with RCC-5 relations as well. Given two aligned taxonomies, CleanTax can infer new relations (articulations) between their concepts, detect...

متن کامل

Reasoning about taxonomies in first-order logic

Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For example, a query such as “how many occurrences of specimens in genus G are recorded in database D” will return different answers depending on whose definition of genus G is used. In our proposed framework, taxonomic classifi...

متن کامل

Names are not good enough: Reasoning over taxonomic change in the Andropogon complex

We present a novel, logic-based solution to the challenge of reconciling the meanings of taxonomic names across multiple biological taxonomies. The challenge arises due to limitations inherent in using type-anchored taxonomic names as identifiers of granular semantic similarities and differences being expressed in original and revised taxonomic classifications. We address this challenge through...

متن کامل

A relation - algebraic approach to the region connection calculus

We explore the relation–algebraic aspects of the region connection calculus (RCC) of Randell et al. (1992a). In particular, we present a refinement of the RCC8 table which shows that the axioms provide for more relations than are listed in the present table. We also show that each RCC model leads to a Boolean algebra. Finally, we prove that a refined version of the RCC5 table has as models all ...

متن کامل

Improving Taxonomy Maintenance: Automated Splitting and Merging of Taxonomies

In Case-Based Reasoning (CBR), taxonomies are often used to model similarities. For complex domains and tasks such taxonomies tend to increase in size making them hard to model and maintain. This especially holds true if a group of people is working on the same taxonomy simultaneously. In this paper, we propose a solution by dividing larger taxonomies into sub-taxonomies, which can be regarded ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009